Explicit fairness in testing semantics
نویسندگان
چکیده
In this paper we investigate fair computations in the π-calculus [25]. Following Costa and Stirling’s approach for CCS-like languages [10, 11], we consider a method to label process actions in order to filter out unfair computations. We contrast the existing fair-testing notion [35, 26] with those that naturally arise by imposing weak and strong fairness. This comparison provides insight about the expressiveness of the various ‘fair’ testing semantics and about their discriminating power.
منابع مشابه
Strong Fairness and Full Abstraction for Communicating Processes
We construct several denotational semantics for communicating processes that incorporate assumptions of strong (process) fairness. Strong fairness is the guarantee that every process enabled infinitely often will make progress infinitely often. Modeling fairness compositionally requires care: generally speaking, the fair computations of a command cannot be defined only in terms of the fair comp...
متن کاملTowards a Theory of Actor Computation
In this paper we present preliminary results of a rigorous development of the actor model of computation. We present an actor language which is an extension of a simple functional language, and provide a precise operational semantics for this extension. Our actor systems are open distributed systems, meaning we explicitly take into account the interface with external components in the speciicat...
متن کاملA Foundation for Actor Computation
We present an actor language which is an extension of a simple functional language, and provide an operational semantics for this extension. Actor configurations represent open distributed systems, by which we mean that the specification of an actor system explicitly takes into account the interface with external components. We study the composability of such systems. We define and study variou...
متن کاملPerformance and Robustness Testing of Explicit-Rate ABR Flow Control Schemes
The objective of this paper is to compare and evaluate three candidate ABR flow control strategies (ERICA, ERICA+, and DEBRA) for ATM networks, using simulation. A set of benchmark network scenarios is proposed and used to illustrate various properties of each algorithm, such as efficiency, fairness, responsiveness, and scalability, as well as robustness in the presence of uncooperative sources...
متن کاملLiveness, Fairness and Impossible Futures
Impossible futures equivalence is the semantic equivalence on labelled transition systems that identifies systems iff they have the same “AGEF” properties: temporal logic properties saying that reaching a desired outcome is not doomed to fail. We show that this equivalence, with an added root condition, is the coarsest congruence containing weak bisimilarity with explicit divergence that respec...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Logical Methods in Computer Science
دوره 5 شماره
صفحات -
تاریخ انتشار 2008